翻訳と辞書 |
Compression theorem : ウィキペディア英語版 | Compression theorem In computational complexity theory the compression theorem is an important theorem about the complexity of computable functions. The theorem states that there exists no largest complexity class, with computable boundary, which contains all computable functions. ==Compression theorem== Given a Gödel numbering of the computable functions and a Blum complexity measure where a complexity class for a boundary function is defined as : Then there exists a total computable function so that for all : and :
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Compression theorem」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|